package org.leetcode.middle.leetcode1143;

public class Solution2 {
    public int longestCommonSubsequence(String text1, String text2) {

        int n1 =text1.length();
        int n2 =text2.length();

        int [][] dp = new int[n1+1][n2+1];

        int maxLength = 0;

        for (int i = 1; i <= n1 ; i++) {
            for (int j = 1; j <= n2; j++) {
                if (text1.charAt(i-1)==text2.charAt(j-1)){
                    dp[i][j]=dp[i-1][j-1]+1;
                }else {
                    dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
                }

                maxLength=Math.max(maxLength,dp[i][j]);
            }
        }


        return maxLength;
    }
}
